Information flow versus divisibility for qubit evolution
نویسندگان
چکیده
منابع مشابه
non-divisibility for abelian groups
Throughout all groups are abelian. We say a group G is n-divisible if nG = G. If G has no non-zero n-divisible subgroups for all n>1 then we say that G is absolutely non-divisible. In the study of class C consisting all absolutely non-divisible groups such as G, we come across the sub groups T_p(G) = the sum of all p-divisible subgroups and rad_p(G) = the intersection of all p^nG. The proper...
متن کامل1-qubit versus 2-qubit measurement based quantum computing
We present a comprehensive and universal quantum computing model based on 2-qubit measurements (TQC), which embeds trivially in a model based on 1-qubit measurements known as the one-way model (1WQC). One inherits through this embedding a calculus whereby each TQC computing pattern can be put in a standard form where entanglement is done first, then measurement, then local corrections.
متن کاملDifferential Privacy versus Quantitative Information Flow
Differential privacy is a notion of privacy that has become very popular in the database community. Roughly, the idea is that a randomized query mechanism provides sufficient privacy protection if the ratio between the probabilities of two different entries to originate a certain answer is bound by e. In the fields of anonymity and information flow there is a similar concern for controlling inf...
متن کاملPerfect divisibility and 2-divisibility
A graph G is said to be 2-divisible if for all (nonempty) induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that ω(A) < ω(H) and ω(B) < ω(H). A graph G is said to be perfectly divisible if for all induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that H[A] is perfect and ω(B) < ω(H). We prove that if a graph is (P5, C5)-free, then it is 2-divisibl...
متن کاملInformation Theoretic Representations of Qubit Channels
A set of qubit channels has a classical representation when it is isomorphic to the convex closure of a group of classical channels. From Crowder and Martin (Proceedings of Quantum Physics and Logic, Electronic Notes in Theoretical Computer Science, 2009), we know that up to isomorphism there are five such sets, each corresponding to either a subgroup of the alternating group on four letters, o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2019
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.99.042105